Patterns of Matching and Systems with Internality
نویسنده
چکیده
In this work, we describe a theoretical model that predicts the existence of three patterns of subjects’ behavior in an experimental chamber with concurrent schedules of reinforcements. Two of these patterns were found earlier by Baum (2002). The model is based on the assumption that an organism is a system with internality and that the alternatives are polarized for the subject: one of them plays the role of the positive pole and the other that of the negative pole. Polarization may be independent of the alternatives’ richness with food. We demonstrate that the generalized matching law can be regarded as an empirical approximation of the theoretical equation, which connects the system’s internal variable with the influence of the environment and probabilities of alternatives choosing. The Generalized Matching Law (Baum, 1974) shows the relation between responses and reinforcements in the experiments with concurrent schedules of reinforcements: log log log N N c n n b 2 1 2 1 = + , (1) where N1 and N2 are numbers of responses and n1 and n2 are numbers of corresponding reinforcements in one experimental session. Parameters c and b are constant during the entire set of sessions in which schedule intervals vary from session to session for each key. It was found later (Baum et al., 1999) that when pigeons were exposed to a pair of concurrent VI schedules long enough, the behavior ratio deviated systematically from equation (1). Fig.1. Baum’s patterns.
منابع مشابه
Centralized Clustering Method To Increase Accuracy In Ontology Matching Systems
Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...
متن کاملAdaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملSemantic processing survey of spoken and written words in adolescents with cerebral palsy: Evidence from PALPA word-picture matching test
Objective: The present study aimed to assess and compare semantic processing of spoken and written words in adolescents with cerebral palsy and healthy adolescents. Method: The present study is quantitative in terms of type and experimental in terms of method. Examination Group consisted 30 adolescents with cerebral palsy aged 10 to 15 years were selected by convenience sampling method. All of ...
متن کاملNew adaptive interpolation schemes for efficient meshbased motion estimation
Motion estimation and compensation is an essential part of existing video coding systems. The mesh-based motion estimation (MME) produces smoother motion field, better subjective quality (free from blocking artifacts), and higher peak signal-to-noise ratio (PSNR) in many cases, especially at low bitrate video communications, compared to the conventional block matching algorithm (BMA). Howev...
متن کامل